Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.


QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.

We use [27] with the following order to prove termination.

Knuth-Bendix order [24] with precedence:
trivial

and weight map:

g_1=2
dummyConstant=1
f_1=3